Organic Programming for Multi-Agents

نویسندگان

  • Hideyuki Nakashima
  • Itsuki Noda
  • Ichiro Osawa
چکیده

We are developing a new software methodology for building large, complicated systems out of simple units. In this paper, we describe application of aa orglmic progr~mrniug to multi-agent systems. One of the advantages resides in that we can program the system in a subsumptive manner.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Subsumption Architecture for Programming Intelligent Agents

This paper describes the application of an organic programming language Gaea in programming complex and exible multi-agent systems. We consider a soccer game as an example. Using organic programming, we can program soccer players in an extended version of a subsumption architecture, called a dynamic subsumption architecture, which is more exible and eecient than the original one.

متن کامل

A new solving approach for fuzzy multi-objective programming problem in uncertainty conditions by ‎using semi-infinite linear programing

In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...

متن کامل

An Optimization Model for Multi-objective Closed-loop Supply Chain Network under uncertainty: A Hybrid Fuzzy-stochastic Programming Method

In this research, we address the application of uncertaintyprogramming to design a multi-site, multi-product, multi-period,closed-loop supply chain (CLSC) network. In order to make theresults of this article more realistic, a CLSC for a case study inthe iron and steel industry has been explored. The presentedsupply chain covers three objective functions: maximization ofprofit, minimization of n...

متن کامل

A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995